Domain Decomposition Methods for PDE Constrained Optimization Problems
نویسندگان
چکیده
Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange-Newton-KrylovSchwarz (LNKSz) algorithms. In LNKSz, a Lagrangian functional is formed and differentiated to obtain a Karush-Kuhn-Tucker (KKT) system of nonlinear equations. Inexact Newton method with line search is then applied. At each Newton iteration the linearized KKT system is solved with a Schwarz preconditioned Krylov subspace method. We apply LNKSz to the parallel numerical solution of some boundary control problems of two-dimensional incompressible Navier-Stokes equations. Numerical results are reported for different combinations of Reynolds number, mesh size and number of parallel processors.
منابع مشابه
Domain decomposition in time for PDE-constrained optimization
PDE-constrained optimization problems have a wide range of applications, but they lead to very large and ill-conditioned linear systems, especially if the problems are time dependent. In this paper we outline an approach for dealing with such problems by decomposing them in time and applying an additive Schwarz preconditioner in time, so that we can take advantage of parallel computers to deal ...
متن کاملDomain decomposition and model reduction for the numerical solution of PDE constrained optimization problems with localized optimization variables
We introduce a technique for the dimension reduction of a class of PDE constrained optimization problems governed by linear time dependent advection diffusion equations for which the optimization variables are related to spatially localized quantities. Our approach uses domain decomposition applied to the optimality system to isolate the subsystem that explicitly depends on the optimization var...
متن کاملSchedule of Talks
9:15 9:30 Opening 9:30 10:30 John A. Burns Sensitivity Analysis, Transition to Turbulence and Control 10:30 11:00 Coffee Break 11:00 12:00 Rainer Tichatschke Bregman-function-based regularization of variational inequalities with monotone operators 12:00 13:00 Lunch Break 13:00 14:00 Stefan Ulbrich Parallel All-at-Once methods with ”Parareal” time-domain decomposition for time-dependent PDE-cons...
متن کاملMulti-preconditioned Gmres
Standard Krylov subspace methods only allow the user to choose a single preconditioner, although in many situations there may be a number of possibilities. Here we describe an extension of GMRES, multi-preconditioned GMRES, which allows the use of more than one preconditioner. We give some theoretical results, propose a practical algorithm, and present numerical results from problems in domain ...
متن کامل